A note on nearly platonic graphs
نویسندگان
چکیده
We define a nearly platonic graph to be a finite k-regular simple planar graph in which all but a small number of the faces have the same degree. We show that it is impossible for such a graph to have exactly one disparate face, and offer some conjectures, including the conjecture that nearly platonic graphs with two disparate faces come in a small set of families.
منابع مشابه
Perfect $2$-colorings of the Platonic graphs
In this paper, we enumerate the parameter matrices of all perfect $2$-colorings of the Platonic graphs consisting of the tetrahedral graph, the cubical graph, the octahedral graph, the dodecahedral graph, and the icosahedral graph.
متن کاملThe spectrum of Platonic graphs over finite fields
We give a decomposition theorem for Platonic graphs over finite fields and use this to determine the spectrum of these graphs. We also derive estimates for the isoperimetric numbers of the graphs. THE SPECTRUM OF PLATONIC GRAPHS OVER FINITE FIELDS MICHELLE DEDEO, DOMINIC LANPHIER, AND MARVIN MINEI Abstract. We give a decomposition theorem for Platonic graphs over finite fields and use this to d...
متن کاملA note on vague graphs
In this paper, we introduce the notions of product vague graph, balanced product vague graph, irregularity and total irregularity of any irregular vague graphs and some results are presented. Also, density and balanced irregular vague graphs are discussed and some of their properties are established. Finally we give an application of vague digraphs.
متن کاملA Note on Tensor Product of Graphs
Let $G$ and $H$ be graphs. The tensor product $Gotimes H$ of $G$ and $H$ has vertex set $V(Gotimes H)=V(G)times V(H)$ and edge set $E(Gotimes H)={(a,b)(c,d)| acin E(G):: and:: bdin E(H)}$. In this paper, some results on this product are obtained by which it is possible to compute the Wiener and Hyper Wiener indices of $K_n otimes G$.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Australasian J. Combinatorics
دوره 70 شماره
صفحات -
تاریخ انتشار 2018